Efficient Adaptive Data Compression Using Fano Binary Search Trees
نویسندگان
چکیده
In this paper, we show an effective way of using adaptive self-organizing data structures in enhancing compression schemes. We introduce a new data structure, the Partitioning Binary Search Tree (PBST), which is based on the well-known Binary Search Tree (BST), and when used in conjunction with Fano encoding, the PBST leads to the so-called Fano Binary Search Tree (FBST). The PBST and FBST can be maintained adaptively and in a self-organizing manner by using new tree-based operators, namely the Shift-To-Left (STL) and the Shift-ToRight (STR) operators. The encoding and decoding procedures that also update the FBST have been implemented, and show that the adaptive Fano coding using FBSTs, the Huffman, and the greedy adaptive Fano coding achieve similar compression ratios.
منابع مشابه
An efficient compression scheme for data communication which uses a new family of self-organizing binary search trees
In this paper, we demonstrate that we can effectively use results from the field of adaptive self-organizing data structures in enhancing compression schemes. Unlike adaptive lists, which have already been used in compression, to the best of our knowledge, adaptive self-organizing trees have not been used in this regard. To achieve this, we introduce a new data structure, the Partitioning Binar...
متن کاملA Fast and E cient Nearly-Optimal Adaptive Fano Coding Scheme
Adaptive coding techniques have been increasingly used in lossless data compression. They are suitable for a wide range of applications, in which on-line compression is required, including communications, internet, e-mail, and e-commerce. In this paper, we present an adaptive Fano coding method applicable to binary and multi-symbol code alphabets. We introduce the corresponding partitioning pro...
متن کاملA fast and efficient nearly-optimal adaptive Fano coding scheme
Adaptive coding techniques have been increasingly used in lossless data compression. They are suitable for a wide range of applications, in which on-line compression is required, including communications, internet, e-mail, and e-commerce. In this paper, we present an adaptive Fano coding method applicable to binary and multi-symbol code alphabets. We introduce the corresponding partitioning pro...
متن کاملAdaptive Binary Arithmetic coder used in SPIHT for high performance applications
Adaptive Binary Arithmetic coder used in SPIHT for high performance applications K. SUBBA RAMI REDDY, P. HARINATH REDDY 2 M.Tech (VLSI) Student, Assistant Professor & HOD, Department of ECE, Srinivasa Institute of Technology and Science Ukkayapalli, Kadapa-A.P.India _________________________________________________________________________ ABSTRACT: A High throughput memory-efficient arithmetic ...
متن کاملAdvanced Lossless Text Compression Algorithm Based on Splay Tree Adaptive Methods
Splay Trees are usually considered forms of lexicographically ordered binary search trees [1, 2]. The motivation of this paper comes from the fact that the search trees have multiples drawbacks. These data structures are created to reduce the worst-case time per operation. However, in typical applications of search trees [3] are performed several operations, not a single one, and what matters i...
متن کامل